Finding Regions for Local Repair in Partial CSP Solutions
نویسنده
چکیده
In contrast to standard constraint satisfaction problems (CSPs) practical applications often require both, the management of changing validity of constraints and variables. Based on experiences made with the development of a commercial nurse scheduling system this paper suggests the application of local optimization algorithms for knowledge-based connguration systems, which strongly rely on dynamic constraint management. The main contribution is a small theory on how to enumerate the regions (a set of assignments) in a partial solution to a constraint problem, which have to be changed in order to obtain a global solution. Such a theory enables the application of local repair mechanisms to knowledge-based systems.
منابع مشابه
Extending Fuzzy Constraint Satisfaction Problems
This paper propose a new type of Fuzzy CSP(Constraint Satisfaction Problem) that have a mixture of discrete and continuous domains, and a Spread-Repair algorithm. In traditional CSP and Fuzzy CSP, values for the variables are chosen from the discrete domains. However, this is often inconvenient when one wants to express real world problems. We show that this model, called HDFCSP(Hybrid Domain F...
متن کاملApproximating Partial Interchangeability in CSP Solutions
The concept of interchangeability characterizes the possibilities for making local changes to CSP solutions. Often, interchangeability is only partial and also requires changing values assigned to other variables, called the dependent set. As partial interchangeability (PI) can only be computed by solving the whole problem, it needs to be approximated. We introduce the new concept of neighborho...
متن کاملCombining Local Search and Constraint Propagation to Find a Minimal Change Solution for a Dynamic CSP
Many hard practical problems such as Time Tabling and Scheduling can be formulated as Constraint Satisfaction Problems. For these CSPs, powerful problem-solving methods are available. However, in practice, the problem definition may change over time. Each separate change may invoke a new CSP formulation. The resulting sequence of CSPs is denoted as a Dynamic CSP. A valid solution of one CSP in ...
متن کاملExploiting the Structure of Constraint Satisfaction Problems by Interchangeability
Till now days there are methods for abstraction and reformulation of CSPs which facilitate easier and faster solving of CSPs [1] but there are not yet methods for organising and structuring the solution space. The thesis work proposed here is primely motivated by the need for an method for classifying and structuring the solutions of CSPs. Classical enumerative methods are deficient in organisi...
متن کاملThe Study of Some Boundary Value Problems Including Fractional Partial Differential Equations with non-Local Boundary Conditions
In this paper, we consider some boundary value problems (BVP) for fractional order partial differential equations (FPDE) with non-local boundary conditions. The solutions of these problems are presented as series solutions analytically via modified Mittag-Leffler functions. These functions have been modified by authors such that their derivatives are invariant with respect to fractional deriv...
متن کامل